# -*- coding: utf-8 -*-
"""
Created on Tue Nov 15 10:39:05 2022

@author: YSL
"""
#%clear
num=[1, 10, 4, 2, 9, 2, 34, 5, 9, 8, 5, 0]
k=13
maxorder=[i for i in range(k)]
while True:
    maxnum=num[0]
    j=0
    for i in range(k-1):
        if maxnum<num[i]:
            maxnum=num[i]
            j=i
#寻找倒数第k-1大的数
    n=maxorder[j]
    maxorder[j]=maxorder[k-2]
    maxorder[k-2]=n
    
    t=num[j]
    num[j]= num[k-2]
    num[k-2]=t
    k-=1
    
    if k==2:break
    
for i in range(12):
    print("%2d" % num[i],end=',')
print()
for i in range(12):
    print("%2d" % maxorder[i],end=',')